Forward - Fast - Sear h : Another Fast Variant of the Boyer - Moore String Mat

Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of text hara ter inspe tions, and number of hara ter omparisons.